Evaluating a $2M Commercial Server on a $2K PC and Related Challenges

نویسنده

  • Mark D. Hill
چکیده

Talk Abstract Many future multiprocessor servers will execute large commercial workloads, such as database management systems and web servers. Thus, simulations of new multiprocessor designs should run these workloads. However, simulating expensive servers running these large workloads on low-cost personal computers presents many challenges. Most of this talk discusses the Wisconsin Multifacet project's approach to commercial workload simulation [1]: Multifacet's Simulation Infrastructure and Workload Development Process. Our infrastructure uses real hardware , locally-developed simulators, and Virtutech Simics. Our workload development process selects commercial workloads, tunes them on real hardware, scales them for simulation, and then re-tunes the scaled workloads. Managing Simulator Complexity. We separate the timing simulator from the functional simulator. The timing sim-ulator mimics the micro-architectural timing of alternative future systems, along with the functional behavior of dynamically common instructions. The functional simulator, Simics, checks the timing simulator by modeling full-system functionality. Coping with Workload Variability. Small changes in micro-architectural parameters can cause multithreaded work-loads to follow different paths (e.g., due to lock race and OS scheduling). We add pseudo-randomness to our deter-ministic simulation to enable standard statistical analyses to distinguish significant effects from random ones. that include making simulators more modular, developing benchmarks more appropriate to target areas, expanding the use of analytic models to complement simulation, and increased emphasis on validating results via multiple methods. The results I present reflect the creativity of the authors of the original works, whereas errors in this talk are mine.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulating a $2M commercial server on a $2K PC - Computer

T he Internet has made database management systems and Web servers integral parts of today’s business and communications infrastructure. These and other commercial transaction-processing applications work with critical personal and business data—storing it, providing access to it, and manipulating it. As dependence on these applications increases, so does the need for them to run reliably and e...

متن کامل

On The Perimeter of an Ellipse

Let E be the ellipse with major and minor radii a and b respectively, and Pbe its perimeter, then P = lim 4 tan(p/n)(a + b + 2) Σ a2 cos2 (2k-2)Pi/n+ sin2 (2k-2)Pi/n; where n = 2m. So without considering the limit, it gives a reasonable approxi-mation for P, it means that we can choose n large enough such that the amountof error be less than any given small number. On the other hand, the form...

متن کامل

On periods of Edon-(2m, 2k) Family of Stream Ciphers

Modularity of the design of Edon80 stream cipher allows us to define a family of stream ciphers Edon-(2m, 2k) where the value 2m is the number of internal quasigroup transformations and 2k is the bit size of the key. That allows us further to derive the distribution of the periods of the keystreams produced by every stream cipher in that family. We show that the obtained distribution is LogNorm...

متن کامل

Products and Sums Divisible by Central Binomial Coefficients

In this paper we study products and sums divisible by central binomial coefficients. We show that 2(2n+ 1) ( 2n n ) ∣∣∣∣ (6n 3n )( 3n n ) for all n = 1, 2, 3, . . . . Also, for any nonnegative integers k and n we have ( 2k k ) ∣∣∣∣ (4n+ 2k + 2 2n+ k + 1 )( 2n+ k + 1 2k )( 2n− k + 1 n ) and ( 2k k ) ∣∣∣∣ (2n+ 1)(2n n ) Cn+k ( n+ k + 1 2k ) , where Cm denotes the Catalan number 1 m+1 ( 2m m ) = (...

متن کامل

On Divisibility of Convolutions of Central Binomial Coefficients

Recently, Z. Sun proved that 2 (2m + 1) ( 2m m ) | ( 6m 3m )( 3m m ) for m ∈ Z>0. In this paper, we consider a generalization of this result by defining bn,k = 2k (n + 2k − 2)!! (n− 2)!! k! . In this notation, Sun’s result may be expressed as 2 (2m + 1) | b(2m+1),(2m+1)−1 for m ∈ Z>0. In this paper, we prove that 2n | bn,un±2r for n ∈ Z>0 and u, r ∈ Z>0 with un ± 2r > 0. In addition, we prove a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001